package leetcode.other;

import java.util.ArrayList;
import java.util.List;
import java.util.stream.Stream;

/**
 * @author cyt
 * @create 2020-07-21 8:57
 */
public class T95 {
    /**
     * 得到 1 - n 中所有可能的二叉搜索树
     * <p>
     * i 为根节点的话， i 左边的数 为左子树 （可多个）， 右边的为右子树
     *
     * @param n
     * @return
     */
    public List<TreeNode> generateTrees(int n) {

        for (int i = 1; i <= n; i++) {


        }

        ArrayList<Object> list = new ArrayList<>();

        Stream<Object> stream = list.stream();


        return new ArrayList<>();
    }
}


/**
 * 二叉树的定义
 */
class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;

    TreeNode() {
    }

    TreeNode(int val) {
        this.val = val;
    }

    TreeNode(int val, TreeNode left, TreeNode right) {
        this.val = val;
        this.left = left;
        this.right = right;
    }
}
